k − Perfect Geodomination is Affected by Adding a Pendant Vertex
نویسندگان
چکیده
A k−geodominating set is a geodominating set S such that any vertex v ∈ V (G)\S is geodominated by a pair x, y of vertices of S with d(x, y) = k. A k-perfect geodominating set is a geodominating set S such that any vertex v ∈ V (G) \ S is geodominated by exactly one pair x, y of the vertices of S with d(x, y) = k. The cardinality of a minimum perfect geodominating set in G is its perfect geodomination number gp(G) and the cardinality of a minimum k-perfect geodominating set in G is its k-perfect geodomination number gkp(G). We investigate the affection of k-perfect geodomination numbers of a graph G when a pendant vertex is added. Mathematics Subject Classification: 05C69
منابع مشابه
Geodomination in Graphs
In this paper we will define the new concepts independent geodomination, independent k-geodomination numbers and then state some results for graphs and Cartesian product of them. Finally we verify how independent geodomination numbers are affected by adding a vertex. Mathematics Subject Classification: 05C
متن کاملOptimizing Bull-Free Perfect Graphs
A bull is a graph obtained by adding a pendant vertex at two vertices of a triangle. Here we present polynomial-time combinatorial algorithms for the optimal weighted coloring and weighted clique problems in bull-free perfect graphs. The algorithms are based on a structural analysis and decomposition of bull-free perfect graphs.
متن کاملEla on the Distance Spectral Radius of Unicyclic Graphs with Perfect Matchings
Abstract. For a connected graph, the distance spectral radius is the largest eigenvalue of its distance matrix. Let U1 2k be the graph obtained from C3 by attaching a path of length n− 3 at one vertex. Let U2 2k be the graph obtained from C3 by attaching a pendant edge together with k − 2 paths of length 2 at the same vertex. In this paper, it is proved that U1 2k (resp., U 2 2k) is the unique ...
متن کاملWeak geodomination in graphs
A pair x, y of vertices in a nontrivial connected graph G is said to geodominate a vertex v of G if either v ∈ {x, y} or v lies in an x − y geodesic of G. A set S of vertices of G is a geodominating set if every vertex of G is geodominated by some pair of vertices of S. In this paper we study weak geodomination in a graph G.
متن کاملThe edge fixed geodomination number of a graph
For a vertex x in a connected graph G = (V (G), E(G)) of order p ≥ 3, a set S ⊆ V (G) is an x-geodominating set of G if each vertex v ∈ V (G) lies on an x-y geodesic for some element y in S. The minimum cardinality of an x-geodominating set of G is defined as the x-geodomination number of G, denoted by gx(G). An x-geodominating set of cardinality gx(G) is called a gx-set of G. For an edge e = x...
متن کامل